Affisix: Tool for Prefix Recognition
نویسندگان
چکیده
Affisix is a tool for automatic recognition of affixes. Input: an extensive list of words in a language Output: segments — candidates for affixes • prefixes (in the present shape) • suffixes (another possible use)
منابع مشابه
Real-Time Recognition of Cyclic Strings by One-Way and Two-Way Cellular Automata
This paper discusses real-time language recognition by 1dimensional one-way cellular automata (OCAs) and two-way cellular automata (CAs), focusing on limitations of the parallel computation power. To clarify the limitations, we investigate real-time recognition of cyclic strings of the form uk with u ∈ {0, 1}+ and k ≥ 2. We show a version of pumping lemma for recognizing cyclic strings by OCAs,...
متن کاملA Proof of Finite Family Developments for Higher-Order Rewriting Using a Prefix Property
A prefix property is the property that, given a reduction, the ancestor of a prefix of the target is a prefix of the source. In this paper we prove a prefix property for the class of Higher-Order Rewriting Systems with patterns (HRSs), by reducing it to a similar prefix property of a λ-calculus with explicit substitutions. This prefix property is then used to prove that Higher-order Rewriting S...
متن کاملGoal recognition from incomplete action sequences by probabilistic grammars
This paper summarizes recent progress concerning prefix probability computation for PCFGs in a logic-based modeling language PRISM. A prefix is an initial substring of a sentence and the prefix probability computation is already introduced to PRISM but applications are still scarce. We report a new application to web data that identifies visitors’ intentions, or goals visiting a website from th...
متن کاملTurkish handwritten text recognition: a case of agglutinative languages
We describe a system for recognizing unconstrained Turkish handwritten text. Turkish has agglutinative morphology and theoretically an infinite number of words that can be generated by adding more suffixes to the word. This makes lexicon-based recognition approaches, where the most likely word is selected among all the alternatives in a lexicon, unsuitable for Turkish. We describe our approach ...
متن کاملHigh Performance Parallel Prefix Adders with Fast Carry Chain Logic
Binary adders are the basic and vital element in the circuit designs. Prefix adders are the most efficient binary adders for ASIC implementation. But these advantages are not suitable for FPGA implementation because of CLBs and routing constraints on FPGA. This paper presents different types of parallel prefix adders and compares them with the Simple Adder. The adders are designed using Verilog...
متن کامل